Groups whose prime graph on conjugacy class sizes has few complete vertices
نویسندگان
چکیده
منابع مشابه
Groups whose Bipartite Divisor Graph for Character Degrees Has Five Vertices
Let $G$ be a finite group and $cd^*(G)$ be the set of nonlinear irreducible character degrees of $G$. Suppose that $rho(G)$ denotes the set of primes dividing some element of $cd^*(G)$. The bipartite divisor graph for the set of character degrees which is denoted by $B(G)$, is a bipartite graph whose vertices are the disjoint union of $rho(G)$ and $cd^*(G)$, and a vertex $p in rho(G)$ is conne...
متن کاملGroups Whose Nonlinear Irreducible Characters Separate Element Orders or Conjugacy Class Sizes
A class function φ on a finite group G is said to be an order separator if, for every x and y in G\{1} , φ(x) = φ(y) is equivalent to x and y being of the same order. Similarly, φ is said to be a class-size separator if, for every x and y in G \ {1} , φ(x) = φ(y) is equivalent to |CG(x)| = |CG(y)| . In this paper, finite groups whose nonlinear irreducible complex characters are all order separa...
متن کاملone-prime power hypothesis for conjugacy class sizes
a finite group $g$ satisfies the on-prime power hypothesis for conjugacy class sizes if any two conjugacy class sizes $m$ and $n$ are either equal or have a common divisor a prime power. taeri conjectured that an insoluble group satisfying this condition is isomorphic to $s times a$ where $a$ is abelian and $s cong psl_2(q)$ for $q in {4,8}$. we confirm this conjecture.
متن کاملGroups whose set of vanishing elements is exactly a conjugacy class
Let $G$ be a finite group. We say that an element $g$ in $G$ is a vanishing element if there exists some irreducible character $chi$ of $G$ such that $chi(g)=0$. In this paper, we classify groups whose set of vanishing elements is exactly a conjugacy class.
متن کاملTwo-groups with Few Conjugacy Classes
An old question of Brauer asking how fast numbers of conjugacy classes grow is investigated by considering the least number cn of conjugacy classes in a group of order 2n. The numbers cn are computed for n ≤ 14 and a lower bound is given for c15. It is observed that cn grows very slowly except for occasional large jumps corresponding to an increase in coclass of the minimal groups Gn. Restricti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 2012
ISSN: 0021-8693
DOI: 10.1016/j.jalgebra.2012.04.013